The Prox-tikhonov-like Forward-backward Method and Applications

نویسندگان

  • D. R. Sahu
  • Q. H. Ansari
  • J. C. Yao
چکیده

It is known, by Rockafellar [SIAM J. Control Optim., 14 (1976), 877898], that the proximal point algorithm (PPA) converges weakly to a zero of a maximal monotone operator in a Hilbert space, but it fails to converge strongly. Lehdili and Moudafi [Optimization, 37(1996), 239-252] introduced the new proxTikhonov regularization method for PPA to generate a strongly convergent sequence and established a convergence property for it by using the technique of variational distance in the same space setting. In this paper, the prox-Tikhonov regularization method for the proximal point algorithm of finding a zero for an accretive operator in the framework of Banach space is proposed. Conditions which guarantee the strong convergence of this algorithm to a particular element of the solution set is provided. An inexact variant of this method with non-summable error sequence is also discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparative Approach to the Backward Elimination and for-ward Selection Methods in Modeling the Systematic Risk Based on the ARFIMA-FIGARCH Model

The present study aims to model systematic risk using financial and accounting variables. Accordingly, the data for 174 companies in Tehran Stock Exchange are extracted for the period of 2006 to 2016. First, the systematic risk index is estimated using the ARFIMA-FIGARCH model. Then, based on the research background, 35 affective financial and accounting variables are simultaneously used with t...

متن کامل

The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces

It is known, by Rockafellar (SIAM J Control Optim 14:877–898, 1976), that the proximal point algorithm (PPA) converges weakly to a zero of a maximal monotone operator in a Hilbert space, but it fails to converge strongly. Lehdili and Moudafi (Optimization 37:239–252, 1996) introduced the new prox-Tikhonov regularization method for PPA to generate a strongly convergent sequence and established a...

متن کامل

Optimization of Preparation Factors for Cerium Oxide Synthesis as a Support for CO PrOx Catalyst

Nanocrystalline ceria has been considered as support for carbon monoxide preferentially oxidation. In this study ceria was prepared by precipitation method and the effects of preparation conditions, such as pH of solution (8-10), aging time (1-12 hr), drying temperature (80-120 °C), calcination time (2-6 hr) and temperature (400-600 °C) were investigated on ceria synthesized powders properties....

متن کامل

A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space

We consider the task of computing an approximate minimizer of the sum of a smooth and non-smooth convex functional, respectively, in Banach space. Motivated by the classical forward-backward splitting method for the subgradients in Hilbert space, we propose a generalization which involves the iterative solution of simpler subproblems. Descent and convergence properties of this new algorithm are...

متن کامل

ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014